Making the Analysis of Complicated Algorithms Fun: A Manifesto for the Computational Method

We promote the much maligned computational method. The computational method is a paradigm for proving mathematical results where the burden of doing the “grunt work” is given to our able research assistant, the computer. We assert that proofs using the computational method, also known as computer aided proofs, are here to stay. In fact, the use of a computer can make the analysis of complicated algorithms fun. We illustrate the usefulness of the method by analyzing a randomized algorithm for multi-processor scheduling with rejection.